A Survey on Priority Queues
نویسنده
چکیده
Back in 1964 Williams introduced the binary heap as a basic priority queue data structure supporting the operations Insert and ExtractMin in logarithmic time. Since then numerous papers have been published on priority queues. This paper tries to list some of the directions research on priority queues has taken the last 50 years.
منابع مشابه
3 Cache - Oblivious Priority Queues
Last lecture we discussed the cache-oblivious model for algorithm and data structure design, and surveyed current results within this model. During this survey, we developed the idea of a cacheoblivious dynamic B-tree. In order to construct this data structure, we utilized a black box component data structure that could maintain an array of N elements in order in O(N) space and achieve insert/d...
متن کاملExperimental Study of High Performance Priority Queues
The priority queue is a very important and widely used data structure in computer science, with a variety of applications including Dijkstra’s Single Source Shortest Path algorithm on sparse graph types. This study presents the experimental results of a variety of priority queues. The focus of the experiments is to measure the speed and performance of highly specialized priority queues in out-o...
متن کاملSprayLists: Provably Correct Approximate Priority Queues in a Shared Memory Setting
An important data structure well understood in sequential settings is the priority queue, which supports the following three operations: insert(x), which inserts an item with priority x, delete(x), which deletes the item with priority x, and deleteMin, which deletes and returns the item with lowest priority. Fibonacci heaps [4] support deleteMin and delete in amortized logarithmic time, and ins...
متن کاملPriority Queues on Parallel Machines
We present time and work optimal priority queues for the CREW PRAM, supporting FindMin in constant time with one proces-and DecreaseKey in constant time with O(log n) processors. A priority queue can be build in time O(log n) with O(n= log n) processors and k elements can be inserted into a priority queue in time O(log k) with O((log n + k)= log k) processors. With a slowdown of O(log log n) in...
متن کاملSchedulability Comparisons between Priority Queue and FIFO Queue for CAN Messages with Offsets
The Controller Area Network (CAN) is a widely used in-vehicle network and its schedulability is particularly important. In a CAN system, implementing the priority queues is better than FIFO queues with respect to the schedulability, which is widely recognized by users. In this paper, we investigate whether and how much implementing the priority queues is better than FIFO queues when the offset ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013